a new concurrency control algorithm in temporal database

the large number of applications manages time varying data. existing databasetechnology seldom supports temporal database, tdb, according to time aspects.these intrinsic temporal database applications rely on such database which storesand retrieves time referenced data. moreover, applications need to be managed oncommon data items access simultaneously and to be precluded from inconsistencyas soon as possible which is the main task of concurrency controller or cc in short.the method used by cc in typical db differs from its attitude with tdb. the varietyalgorithms were proposed regarding to tdb properties by reduction of granule sizeand decreasing the rate of conflicts to satisfy good performance, but none of themhas achieved robust results. there are two categories of cc such as pessimistic andoptimistic. in this paper new approach, with considering the tdb aspects, based onoptimistic method has been suggested. it reclines the size of granule as data itemappropriately and recognizes the conflicts swiftly. consequently, we compare ourproposed algorithm with pervasive 2pl-pessimistic approach. the outcome showsthat new proposed algorithm has high degree of trade off with satisfying nearconflict time detection and high rate of parallelism metrics.